A QoS routing algorithm with "domain" link-state information maintenance
نویسندگان
چکیده
been proposed to meet the QoS requirement of today's multimedia applications. These algorithms can be divided into two categories: source routing and distributed routing. In this paper, we propose a novel QoS routing algorithm, which is an integration of source routing and distributed routing. We introduce the concept of " Domain " which is a set of neighboring nodes and links. Each node has its own " Domain " and has the accurate link-state information within its " Domain ". When a QoS request probe arrives at a node, the node will use the link-state information within its " Domain " to calculate where the probe should be forwarded to and the probe forwarding path. By doing so, the message overhead induced by probe forwarding can be reduced significantly but the overhead induced by link-state information update may increase dramatically. However, if the size of the " Domain " is chosen properly according to the network topology, our algorithm can reduce the message overhead while maintaining high request admission ratio.
منابع مشابه
Improving Quality of Service Routing in Mobile Ad Hoc Networks Using OLSR
Mobile ad hoc networks (MANET) are constructed by mobile nodes without access point. Since MANET has certain constraints, including power shortages, an unstable wireless environment and node mobility, more power-efficient and reliable routing protocols are needed. The OLSR protocol is an optimization of the classical link state algorithm. OLSR introduces an interesting concept, the multipoint r...
متن کاملEvolutionary Computing Assisted Wireless Sensor Network Mining for QoS-Centric and Energy-efficient Routing Protocol
The exponential rise in wireless communication demands and allied applications have revitalized academia-industries to develop more efficient routing protocols. Wireless Sensor Network (WSN) being battery operated network, it often undergoes node death-causing pre-ma...
متن کاملAdvanced operations research techniques for multi-constraint QoS routing in internet
Internet Traffic has grown exponentially over last few years due to provision of multiple class services through Internet backbone. With the explosive use of Internet, contemporary Internet routers are susceptible to overloads and their services deteriorate drastically and often cause denial of services. In this paper, an analysis is made how forecasting technique, routing algorithm and Genetic...
متن کاملCEDAR: a Core-Extraction Distributed Ad Hoc Routing Algorithm
CEDAR is an algorithm for QoS routing in ad hoc network environments. It has three key components: (a) the establishment and maintenance of a self-organizing routing infrastructure called the core for performing route computations, (b) the propagation of the link-state of stable high-bandwidth links in the core through increase/decrease waves, and (c) a QoS route computation algorithm that is e...
متن کاملA comparative study of QoS routing schemes that tolerate imprecise state information
In large networks, maintaining precise global network state information is almost impossible. Many factors, including nonnegligible propagation delay, infrequent link state update due to overhead concerns, link state update policy, resource reservation, and hierarchical topology aggregation, have impacts on the precision of the global network state information. To achieve efficient Quality of S...
متن کامل